Investigating the Mapping between Default Logic and Inconsistency-Tolerant Semantics
نویسندگان
چکیده
In this paper we propose a mapping between inconsistent ontological knowledge bases and semi-monotonic, prerequisite-free closed normal default theories. As a proof of concept of the new results obtained by the proposed mapping we introduce an any-time algorithm for query answering that starts off by a small set of facts and incrementally adds to this set.
منابع مشابه
Four-Valued Semantics for Default Logic
Reiter’s default logic suffers the triviality, that is, a single contradiction in the premise of a default theory leads to the only trivial extension which everything follows from. In this paper, we propose a default logic based on fourvalued semantics, which endows default logic with the ability of handling inconsistency without leading to triviality. We define four-valued models for default t...
متن کاملNon Monotonic Reasoning and Belief
The major approaches to belief revision and non monotonic reasoning proposed in the literature diier along a number of dimensions, including whether they are \syntax-based" or \semantic-based", \foundational" or \coherentist", \consistence{restoring" or \inconsistency{tolerant". Our contribution towards clarifying the connections between these various approaches is threefold: We show that the t...
متن کاملInconsistency-Tolerant Semantics for Description Logics
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Our general goal is both to study DL semantical frameworks which are inconsistency-tolerant, and to devise techniques for answering unions of conjunctive queries posed to DL knowledge bases under such inconsistency-tolerant semantics. Our work is inspired by the approaches to consistent query answe...
متن کاملHandling Probability and Inconsistency in Answer Set Programming
Answer Set Programming (ASP) is a powerful declarative computing paradigm that is especially suitable for modeling commonsense reasoning problems. However, the crisp nature of the underlying semantics, the stable model semantics, makes it difficult to handle reasoning domains involving probability and inconsistency. To address this issue, we present an extension of logic programs under the stab...
متن کاملOn the Complexity of Dealing with Inconsistency in Description Logic Ontologies
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider inconsistency-tolerant semantics recently proposed in the literature, called AR-semantics and CARsemantics, which are based on repairing (i.e., modifying) in a minimal way the extensional knowledge (ABox) while keeping the intensional knowledge (TBox) untouched. We study instance checking and co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015